Cubic Basic Splines and Parallel Algorithms
نویسندگان
چکیده
منابع مشابه
Rational bi-cubic G2 splines for design with basic shapes
The paper develops a rational bi-cubic G2 (curvature continuous) analogue of the non-uniform polynomial C2 cubic B-spline paradigm. These rational splines can exactly reproduce parts of multiple basic shapes, such as cyclides and quadrics, in one by default smoothly-connected structure. The versatility of this new tool for processing exact geometry is illustrated by conceptual design from basic...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملLeast squares cubic splines without B-splines
There are thousands of articles published on variants of splines, including least squares cubic splines. One of the first least squares articles was de Boor and Rice [1], and a comprehensive explanatory textbook is Dierckx [2]. Unfortunately, every example in the literature and on the web of a least squares cubic spline makes use of B-splines. While B-splines have a certain elegance, they are s...
متن کاملSmoothing with Cubic Splines
A spline function is a curve constructed from polynomial segments that are subject to conditions or continuity at their joints. In this paper, we shall present the algorithm of the cubic smoothing spline and we shall justify its use in estimating trends in time series. Considerable effort has been devoted over several decades to developing the mathematics of spline functions. Much of the intere...
متن کاملParallel Algorithms on Three - Levelhierarchical Cubic
In this paper, we propose a novel interconnection network called three-level hierarchical cubic network (3-HCN), which extends the construction of hierarchical cubic networks (HCN) and ooers many additional advantages. The 3-HCN (with diameter links) has diameter smaller than that of an n-cube of the same size and uses nodes of degree 1 3 n + 2. We develop eecient and elegant algorithms for rou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Trends in Computer Science and Engineering
سال: 2020
ISSN: 2278-3091
DOI: 10.30534/ijatcse/2020/219932020